近似贝叶斯深度学习方法对于解决在智能系统中部署深度学习组件时，包括在智能系统中部署深度学习组件的几个问题，包括减轻过度自信的错误并提供增强的鲁棒性，从而超出分发示例。但是，现有近似贝叶斯推理方法的计算要求可以使它们不适合部署包括低功耗边缘设备的智能IOT系统。在本文中，我们为监督深度学习提供了一系列近似贝叶斯推理方法，并在应用这些方法对当前边缘硬件上的挑战和机遇。我们突出了几种潜在的解决方案来降低模型存储要求，提高计算可扩展性，包括模型修剪和蒸馏方法。

自然界中多元化的生态学在许多物种中具有各种形式的群体行为。蝴蝶物种是随机飞行的突出物种之一，有点有见地，并将其转化为人造隐喻将导致巨大的可能性。本文认为一种这种隐喻称为蝴蝶交配优化（BMO）。在BMO中，BFLE遵循巡逻的交配现象，并同时捕获了多模式函数的所有局部优势。为了模仿该算法，设计了一个移动机器人（BFlyBot），以满足BMO算法中BFLE的功能。此外，多Bflybot群的设计旨在像蝴蝶本质上的作用，并遵循该算法的规则。实时实验是在多动物领域的BMO算法上进行的，并将信号源视为光源。实验结果表明，BMO算法适用于检测多个信号源，其运动的变化显着，即静态和动态。在静态信号源的情况下，随着BFlybot的初始位置的不同，收敛性在时间和平稳性方面受到影响。而具有不同阶梯尺寸的实验会导致它们在机器人的执行时间和速度方面的变化。在这项工作中，在动态环境中进行了实验，在该环境中，信号源在操纵和非操作场景中的运动。 Bflybot群能够检测到单个和多信号源，在两个固定点之间在两个固定点之间进行线性移动，以圆形，向上和向下运动。评估BMO现象，各种正在进行的和前瞻性的作品，例如中海船舶检测，讨论了空中搜索应用和地震预测。

在许多图像处理任务中，深度学习方法的成功，最近还将深度学习方法引入了阶段检索问题。这些方法与传统的迭代优化方法不同，因为它们通常只需要一个强度测量，并且可以实时重建相位图像。但是，由于巨大的领域差异，这些方法给出的重建图像的质量仍然有很大的改进空间来满足一般应用要求。在本文中，我们设计了一种新型的深神经网络结构，名为Sisprnet，以基于单个傅立叶强度测量值进行相检索。为了有效利用测量的光谱信息，我们建议使用多层感知器（MLP）作为前端提出一个新的特征提取单元。它允许将输入强度图像的所有像素一起考虑，以探索其全局表示。 MLP的大小经过精心设计，以促进代表性特征的提取，同时减少噪音和异常值。辍学层还可以减轻训练MLP的过度拟合问题。为了促进重建图像中的全局相关性，将自我注意力的机制引入了提议的Sisprnet的上采样和重建（UR）块。这些UR块被插入残留的学习结构中，以防止由于其复杂的层结构而导致的较弱的信息流和消失的梯度问题。使用线性相关幅度和相位的仅相位图像和图像的不同测试数据集对所提出的模型进行了广泛的评估。在光学实验平台上进行了实验，以了解在实用环境中工作时不同深度学习方法的性能。

近年来，已经完成了巨大的努力来推进本领域的自然语言处理（NLP）和音频识别。然而，这些努力通常转化为更大更复杂的模型的功耗和内存要求增加。这些解决方案缺少了需要低功耗，低记忆有效计算的IOT设备的约束，因此它们无法满足高效边缘计算的不断增长的需求。已证明神经形态系统是在多种应用中的低功率低延迟计算的优异候选者。出于这个原因，我们提出了一种神经形态的架构，能够进行无监督的听觉特征识别。然后，我们在Google语音命令数据集的子集上验证网络。

Accurate determination of a small molecule candidate (ligand) binding pose in its target protein pocket is important for computer-aided drug discovery. Typical rigid-body docking methods ignore the pocket flexibility of protein, while the more accurate pose generation using molecular dynamics is hindered by slow protein dynamics. We develop a tiered tensor transform (3T) algorithm to rapidly generate diverse protein-ligand complex conformations for both pose and affinity estimation in drug screening, requiring neither machine learning training nor lengthy dynamics computation, while maintaining both coarse-grain-like coordinated protein dynamics and atomistic-level details of the complex pocket. The 3T conformation structures we generate are closer to experimental co-crystal structures than those generated by docking software, and more importantly achieve significantly higher accuracy in active ligand classification than traditional ensemble docking using hundreds of experimental protein conformations. 3T structure transformation is decoupled from the system physics, making future usage in other computational scientific domains possible.

Variational autoencoders model high-dimensional data by positing low-dimensional latent variables that are mapped through a flexible distribution parametrized by a neural network. Unfortunately, variational autoencoders often suffer from posterior collapse: the posterior of the latent variables is equal to its prior, rendering the variational autoencoder useless as a means to produce meaningful representations. Existing approaches to posterior collapse often attribute it to the use of neural networks or optimization issues due to variational approximation. In this paper, we consider posterior collapse as a problem of latent variable non-identifiability. We prove that the posterior collapses if and only if the latent variables are non-identifiable in the generative model. This fact implies that posterior collapse is not a phenomenon specific to the use of flexible distributions or approximate inference. Rather, it can occur in classical probabilistic models even with exact inference, which we also demonstrate. Based on these results, we propose a class of latent-identifiable variational autoencoders, deep generative models which enforce identifiability without sacrificing flexibility. This model class resolves the problem of latent variable non-identifiability by leveraging bijective Brenier maps and parameterizing them with input convex neural networks, without special variational inference objectives or optimization tricks. Across synthetic and real datasets, latent-identifiable variational autoencoders outperform existing methods in mitigating posterior collapse and providing meaningful representations of the data.

Differentiable Architecture Search (DARTS) has attracted considerable attention as a gradient-based Neural Architecture Search (NAS) method. Since the introduction of DARTS, there has been little work done on adapting the action space based on state-of-art architecture design principles for CNNs. In this work, we aim to address this gap by incrementally augmenting the DARTS search space with micro-design changes inspired by ConvNeXt and studying the trade-off between accuracy, evaluation layer count, and computational cost. To this end, we introduce the Pseudo-Inverted Bottleneck conv block intending to reduce the computational footprint of the inverted bottleneck block proposed in ConvNeXt. Our proposed architecture is much less sensitive to evaluation layer count and outperforms a DARTS network with similar size significantly, at layer counts as small as 2. Furthermore, with less layers, not only does it achieve higher accuracy with lower GMACs and parameter count, GradCAM comparisons show that our network is able to better detect distinctive features of target objects compared to DARTS.

Deep learning techniques with neural networks have been used effectively in computational fluid dynamics (CFD) to obtain solutions to nonlinear differential equations. This paper presents a physics-informed neural network (PINN) approach to solve the Blasius function. This method eliminates the process of changing the non-linear differential equation to an initial value problem. Also, it tackles the convergence issue arising in the conventional series solution. It is seen that this method produces results that are at par with the numerical and conventional methods. The solution is extended to the negative axis to show that PINNs capture the singularity of the function at $\eta=-5.69$

The Government of Kerala had increased the frequency of supply of free food kits owing to the pandemic, however, these items were static and not indicative of the personal preferences of the consumers. This paper conducts a comparative analysis of various clustering techniques on a scaled-down version of a real-world dataset obtained through a conjoint analysis-based survey. Clustering carried out by centroid-based methods such as k means is analyzed and the results are plotted along with SVD, and finally, a conclusion is reached as to which among the two is better. Once the clusters have been formulated, commodities are also decided upon for each cluster. Also, clustering is further enhanced by reassignment, based on a specific cluster loss threshold. Thus, the most efficacious clustering technique for designing a food kit tailored to the needs of individuals is finally obtained.

Learning efficient and interpretable policies has been a challenging task in reinforcement learning (RL), particularly in the visual RL setting with complex scenes. While neural networks have achieved competitive performance, the resulting policies are often over-parameterized black boxes that are difficult to interpret and deploy efficiently. More recent symbolic RL frameworks have shown that high-level domain-specific programming logic can be designed to handle both policy learning and symbolic planning. However, these approaches rely on coded primitives with little feature learning, and when applied to high-dimensional visual scenes, they can suffer from scalability issues and perform poorly when images have complex object interactions. To address these challenges, we propose \textit{Differentiable Symbolic Expression Search} (DiffSES), a novel symbolic learning approach that discovers discrete symbolic policies using partially differentiable optimization. By using object-level abstractions instead of raw pixel-level inputs, DiffSES is able to leverage the simplicity and scalability advantages of symbolic expressions, while also incorporating the strengths of neural networks for feature learning and optimization. Our experiments demonstrate that DiffSES is able to generate symbolic policies that are simpler and more and scalable than state-of-the-art symbolic RL methods, with a reduced amount of symbolic prior knowledge.